Iterative decoding of space time codes
نویسندگان
چکیده
Ever since the seminal paper [6] there has been a flurry on activity on channel coding systems with antennas and multiple input and output (MIMO) for emit and receive through a double coding in time and space [8]. This is in particular of crucial importance in downlink mobile communications. In view of recent advances in channel coding due to iterative decoding (turbocodes and low density parity check codes (LDPC)), recent MIMO schemes have appeared based on iterative decoding [2, 3].
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملPerformance analysis and iterative decoding of I-Q trellis space-time codes
I-Q trellis codes are known to increase the time diversity of coded systems.When I-Q codes are used with multiple transmit antennas, the decoding and performance evaluation requires the construction of the high-complexity super-trellis of the component codes. In the paper, the bit error probability and the design criteria of I-Q space-time (ST) codes are derived using the transfer functions of ...
متن کاملIterative Decoding Algorithms for I-Q Space-Time Codes
I-Q ST codes have shown the potential to provide high coding gains in rapid fading environments. The optimal decoding of I-Q ST codes involves the use of the super-trellis of the I and Q codes, which is complex in general. This paper proposes two iterative decoding algorithms for I-Q ST codes. The proposed algorithms have similar performance to optimal decoding with much lower complexity.
متن کاملComparison of suboptimal iterative Space-Time receivers
At high spectral efficiencies, optimal decoding of Space Time Block Coded (STBC) Multiple Input Multiple Output (MIMO) systems has a critical complexity unless the space-time code structure offers simple optimal decoding, as is the case for Space Time Orthogonal Block Codes (STOBC). Indeed, the complexity of true Maximum Likelihood (ML) decoding or A Posteriori Probability (APP) decoding of ST...
متن کاملCooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel
In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005